On the orthogonalization of arbitrary Boolean formulae
نویسنده
چکیده
The orthogonal conjunctive normal form of a Boolean function is a conjunctive normal form in which any two clauses contain at least a pair of complementary literals. Orthogonal disjunctive normal form is defined similarly. Orthogonalization is the process of transforming the normal form of a Boolean function to orthogonal normal form. The problem is of great relevance in several applications, for example, in the reliability theory. Moreover, such problem is strongly connected with the well-known propositional satisfiability problem. Therefore, important complexity issues are involved. A general procedure for transforming an arbitrary CNF or DNF to an orthogonal one is proposed. Such procedure is tested on randomly generated Boolean formulae.
منابع مشابه
Probabilistic Construction of Monotone Formulae for Positive Linear Threshold Functions
We extend Valiant's construction of monotone formulae for the majority function to obtain an eecient probabilistic construction of small monotone formulae for arbitrary positive linear threshold functions. We show that any positive linear threshold function on n boolean variables which has weight complexity q(n) can be computed by a monotone boolean formula of size O(q(n) 3:3 n 2): Our techniqu...
متن کاملSize-Depth Tradeoffs for Boolean Formulae
We present a simplified proof that Brent/Spira restructuring of Boolean formulas can be improved to allow a Boolean formula of size n to be transformed into an equivalent log depth formula of size O(nα) for arbitrary α > 1.
متن کاملON THE EXPRESSIVE POWER OF PLANNING FORMALISMS ConditionalEffects and Boolean Preconditions in the STRIPS Formalism
The notion of “expressive power” is often used in the literature on planning. However, it is usually only used in an informal way. In this paper, we will formalize this notion using the “compilability framework” and analyze the expressive power of some variants of allowing for conditional effects and arbitrary Boolean formulae in preconditions. One interesting consequence of this analysis is th...
متن کاملModel-independent Bounding of the Supports of Boolean Formulae in Binary Data
Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries from huge data sets. The collection of frequent sets gives a collection of marginal frequencies about the underlying data set. Sometimes, we would like to use a collection of such marginal frequencies instead of the entire data se...
متن کاملOn Orthogonalization Approach to Construct a Multiple Input Transfer Function Model
In this article, a special type of orthogonalization is obtained to construct a multiple input transfer function model. By using this technique, construction of a transfer function model is divided to sequential construction of transfer function models with less input time series. Furthermore, based on real and simulated time series we provide an instruction to adequately perform the stages of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JAMDS
دوره 9 شماره
صفحات -
تاریخ انتشار 2005